#include<bits/stdc++.h>
using namespace std;
int n,a[100005],pos=1;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",a+i);
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
        if(a[i]>a[pos])
            pos++;
    printf("%d",n-pos+1);
    return 0;
}
